Multiprocessor scheduling under precedence constraints: Polyhedral results
نویسندگان
چکیده
منابع مشابه
Min-Sum Scheduling Under Precedence Constraints
In many scheduling situations, it is important to consider non-linear functions of job completions times in the objective. This was already recognized by Smith (1956). Recently, the theory community has begun a thorough study of the resulting problems, mostly on single-machine instances for which all permutations of jobs are feasible. However, a typical feature of many scheduling problems is th...
متن کاملTwo-machine Scheduling under Arbitrary Precedence Constraints
Suppose jobs, in the Johnson's two-machine n-job flow-shop scheduling problem, are grouped into disjoint subsets within which a job order that may not be preempted is specified. Furthermore, suppose that a precedence relation between these subsets is given such that the processing of a subset must be completed, on each machine, before the processing of another subset begins on the machine. This...
متن کاملScheduling under Precedence, Communication, and Energy Constraints
We consider the problem of scheduling a set of n tasks on m processors under precedence, communication, and global system energy constraints to minimize makespan. We extend existing scheduling models to account for energy usage and give convex programming algorithms that yield essentially the same results as existing algorithms that do not consider energy, while adhering to a strict energy bound.
متن کاملLayer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints
c © 2007 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.07.009